Well-covered graphs and factors
نویسندگان
چکیده
منابع مشابه
Well-covered graphs and factors
A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality . Plummer [Some covering concepts in graphs, J. Combin. Theory 8 (1970) 91–98] defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perfect [1, 2]-factor FG, i.e. a spa...
متن کاملWell-covered circulant graphs
A graph is well-covered if every independent set can be extended to a maximum independent set. We show that it is co-NP-complete to determine whether an arbitrary graph is well-covered, even when restricted to the family of circulant graphs. Despite the intractability of characterizing the complete set of well-covered circulant graphs, we apply the theory of independence polynomials to show tha...
متن کاملWell-covered Graphs and Greedoids
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S ∈ Ψ(G), if S is a maximum stable set of the subgraph induced by S ∪ N(S), where N(S) is the neighborhood of S. In 2002 we have proved that Ψ(G) is a greedoid for every forest G. The bipartite graphs and the trianglefree graphs, whose famil...
متن کاملWell-covered graphs and extendability
A graph is k-extendable if every independent set of size k is contained in a maximum independent set. This generalizes the concept of a B-graph (i.e. I-extendable graph) introduced by Berge and the concept of a well-covered graph (i.e. k-extendable for every integer k) introduced by Plummer. For various graph families we present some characterizations of well-covered and k-extendable graphs. We...
متن کاملWeighted Well-covered Graphs and Complexity Questions Weighted Well-covered Graphs and Complexity Questions
A weighted graph G is called well-covered if all its maximal stable sets have the same weight. G. Let S be a stable set of G (possibly, S = ;). The subgraph G?NS] is called a co-stable subgraph of G. We denote by CSub(G) the set of all co-stable subgraphs of G (considered up to isomorphism). A class of weighted graphs P is called co-hereditary if it is closed under taking co-stable subgraphs, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.05.041